Theoretical Investigations on the Modi edInteger Round - Up Property for theOne - Dimensional Cutting
نویسنده
چکیده
Many numerical computations show a small diierence only between the optimal value of the one-dimensional cutting stock problem and that of its corresponding linear programming relaxation. In this paper we investigate the one-dimensional cutting stock problem with respect to the modiied integer roundup property (MIRUP) and present some results on subproblems having the MIRUP.
منابع مشابه
Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem
Many numerical computations show a small difference only between the optimal value of the one-dimensional cutting stock problem and that of its corresponding linear programming relaxation. In this paper we investigate the one-dimensional cutting stock problem with respect to the modified integer round-up property (MIRUP) and present some results on subproblems having the MIRUP.
متن کاملAls Manuskript Gedruckt Technische Universität Dresden Herausgeber: Der Rektor Theoretical Investigations on the Modified Integer Round-up Property for the One-dimensional Cutting Stock Problem
Many numerical computations show an only small difference between the optimal value of the one-dimensional cutting stock problem and that of its corresponding linear programming relaxation. In this paper we investigate the one-dimensional cutting stock problem with respect to the modified integer round-up property (MIRUP) and present some results on subproblems having the MIRUP.
متن کاملNew Cases of the Cutting Stock Problem Having
The modi ed integer round-up property (MIRUP) for a linear integer minimization problem means that the optimal value of this problem is not greater than the optimal value of the corresponding LP relaxation rounded up plus one. In earlier papers the MIRUP was shown to hold for the so-called divisible case and some other subproblems of the one-dimensional cutting stock problem. In this paper we e...
متن کاملThe Modified Integer Round-Up Property of the One-Dimensional Cutting Stock Problem
A linear integer minimization problem (IP) has the modified integer round-up property (MIRUP) if the optimal value of any instance of IP is not greater than the optimal value of the corresponding LP relaxation problem rounded up plus one. The aim of this paper is to investigate numerically whether the MIRUP holds for the one-dimensional cutting stock problem. The computational experiments carri...
متن کاملNumerical investigations on the MIRUP of the 2-stage guillotine cutting stock problem
The MIRUP (Modified Integer Round-Up Property) leads to an upper bound for the gap between the optimal value of the integer problem and that of the corresponding continuous relaxation rounded up. This property is known to hold for many instances of the one-dimensional cutting stock problem but there are not known so far any results with respect to the two-dimensional case. In this paper we inve...
متن کامل